shortest path problem造句
例句与造句
- An approach to the shortest path problem with time - varying
一种求解时变条件下最短路的算法 - Chaotic neural network - based approach to the shortest path problem
基于混沌神经网络最短路问题的优化算法 - Heuristic algorithm for shortest path problem with nonlinear constraints
非线性约束最短路问题的启发式算法 - Shortest path problem with turn penalties and prohibitions and its solutions
带转向延误和限制的最短路径问题及其求解方法 - This paper deals with tsp by transform tsp to a special shortest path problem
本文将解决tsp问题转化为一种特殊的最短路问题。 - It's difficult to find shortest path problem in a sentence. 用shortest path problem造句挺难的
- Improvement of a algorithm and its application in shortest path problem in dynamic networks
算法改进及其在动态最短路径问题中的应用 - Concept and implement of graph , basic operations of graph , minimum cost spanning tree , shortest path problem , aov and aoe network
图的概念和实现；图的基本操作；最小价值生成树；最短路径；活动网络。 - Finally , chapter eleven covers the special topics of the maximal flow problem , the shortest path problem , and the multicommodity minimal cost flow problem
最后，第十一章覆盖了特殊主题：最大化流问题、最短路径问题和多物最小消费流问题。 - Base on exist hardware and network equipment the grid computing experimental environment is constituted in this paper . the parallel dijkstra algorithm to solve the short path problem is tested in the experimental environment
本文在介绍网格计算基本理论基础上，在现有硬件环境下架构了globus试验平台，并在globus网格环境下测试了最短路径问题的并行dijkstra算法。 - This subject will survey some of the applications of network flows and focus on key special cases of network flow problems including the following : the shortest path problem , the maximum flow problem , the minimum cost flow problem , and the multi - commodity flow problem
这个主题将审视一些网流的应用并集中焦点在以下网流问题的关键特殊情况:最短路径问题,最大流量问题,最少成本流量问题,和多元物品流量问题。 - It first shows the building of stochastic , time - dependent network model , the description of k expected shortest paths problem , the demonstration of travel time probability distributions for the arcs in transportation area , and the calculation of expected travel time on path
本文首先给出了随机时间依赖网络模型( stdn模型) 、 k期望最短路径问题的形式化描述，并针对交通应用领域推导出弧耗费服从的概率密度函数，路径期望值的计算方法。 - Concretely we discuss the application of the shortest path problem , traveling salesman problerm and project management method on the touring itinerary improvement of travel agency . furthermore , we explore the use of minimum spanning tree problem , overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots . and also enclosed detailed spreadsheet solutions
具体的，讨论了最短路问题、旅行商问题和排程问题在旅行社线路优化中的应用；讨论了最小支撑树问题、覆盖问题和最大流问题在旅游景区线路优化中的运用，并在附录中给出了详细的电子表格解法。 - Passing through the construction of a special coupled neural network , which can mimic the autowaves in the pulse - coupled neural networks ( pcnns ) , we present a new approach ( auto waves approach ) for solving tsp . the autowaves spread in the network , and the path which the first arrived at the end point from the start point has passed is the optimal answer to the shortest path problem
通过构造耦合神经网络，使得由神经元点火所产生的自动波在其中传播，最先到达目的地的波前所走过的路径即为最短路问题的最优解，从而有效地获得了tsp问题的最优解。 - Standard shortest path algorithms ( such as the dijkstra algorithm ) are not valid , since travel times are random , time - dependent variables . especially , the recognition version of the stochastic shortest path problems is np - complete . k expected shortest paths problem shown in this paper is one of these problems
传统的最短路径方法不能解决这种非线性路径耗费的路径问题，尤其是同时具有随机性和时间依赖性的网络使得最优路径问题成为np完全问题，本文研究的k期望最短路径就是这样的问题之一。